Constrained Shared Locks for Increasing Concurrency in Databases
نویسندگان
چکیده
منابع مشابه
TRINITY COLLEGE Shared Memory Concurrency and Fast, Biased Locks
Declaration I hereby declare that this project is entirely my own work and that it has not been submitted as an exercise for a degree at this or any other university. I agree that the Library and other agents of the College may lend or copy this thesis upon request. ____________________________ ___________ Jimmy Cleary Date 4 Acknowledgements I would like to thank my supervisor, Dr David Gregg,...
متن کاملIncreasing Concurrency in Databases Using Program Analysis
Programmers have come to expect better integration between databases and the programming languages they use. While this trend continues unabated, database concurrency scheduling has remained blind to the programs. We propose that the database client programs provide a large untapped information resource for increasing database throughput. Given this increase in expressive power between programm...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملFast Locks in Distributed Shared Memory Systems
Synchronization and remote memory access delays cause staggering ineeciency in most shared memory programs if run on thousands of processors. This paper introduces eecient lock synchronization using the combination of group write consistency, which guarantees write ordering within groups of processors, and eagersharing distributed memory, which sends newly written data values over fast network ...
متن کاملUTCP: Compositional Semantics for Shared-Variable Concurrency
We present a Unifying Theories of Programming (UTP) semantics of shared variable concurrency that is fully compositional. Previous work was based on mapping such programs, using labelling of decision points and atomic actions, to action systems, which themselves were provided with a UTP semantics. The translation to action systems was largely compositional, but their dynamic semantics was based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1052